Affine Primitive Groups and Semisymmetric Graphs
نویسندگان
چکیده
منابع مشابه
Affine Primitive Groups and Semisymmetric Graphs
In this paper, we investigate semisymmetric graphs which arise from affine primitive permutation groups. We give a characterization of such graphs, and then construct an infinite family of semisymmetric graphs which contains the Gray graph as the third smallest member. Then, as a consequence, we obtain a factorization of the complete bipartite graph Kpspt ,psp into connected semisymmetric graph...
متن کاملcommuting and non -commuting graphs of finit groups
فرض کنیمg یک گروه غیر آبلی متناهی باشد . گراف جابجایی g که با نماد نمایش داده می شود ،گرافی است ساده با مجموعه رئوس که در آن دو راس با یک یال به هم وصل می شوند اگر و تنها اگر . مکمل گراف جابجایی g راگراف نا جابجایی g می نامیم.و با نماد نشان می دهیم. گرافهای جابجایی و ناجابجایی یک گروه متناهی ،اولین بار توسطاردوش1 مطرح گردید ،ولی در سالهای اخیر به طور مفصل در مورد بحث و بررسی قرار گرفتند . در ،م...
15 صفحه اولSemisymmetric graphs from polytopes
Every finite, self-dual, regular (or chiral) 4-polytope of type {3, q, 3} has a trivalent 3-transitive (or 2-transitive) medial layer graph. Here, by dropping self-duality, we obtain a construction for semisymmetric trivalent graphs (which are edgebut not vertex-transitive). In particular, the Gray graph arises as the medial layer graph of a certain universal locally toroidal regular 4-polytope.
متن کاملAffine distance-transitive graphs and classical groups
This paper finishes the classification of primitive affine distance-transitive graphs by dealing with the only case left open, namely where the generalized Fitting subgroup of the stabilizer of a vertex is a finite quasisimple group of classical Lie type defined over the characteristic dividing the number of vertices of the graph. All graphs that are found to occur are known.
متن کاملThe affine primitive permutation groups of degree less than 1000
In this paper we complete the classification of the primitive permutation groups of degree less than 1000 by determining the irreducible subgroups of GL(n, p) for p prime and pn < 1000. We also enumerate the maximal subgroups of GL(8, 2), GL(4, 5) and GL(6, 3). © 2003 Elsevier Science Ltd. All rights reserved. MSC: 20B10; 20B15; 20H30
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2013
ISSN: 1077-8926
DOI: 10.37236/2549